Applying Conceptual Graphs for Inference Detection Using Second Path Analysis
نویسندگان
چکیده
Conceptual graphs are applied to a problem in database inference known as secondpath analysis. A sensitive target is proposed, namely to keep secret that a certain company is working on a certain project. Typically available non-sensitive information is introduced in the form of relational database schemata. These schemata are then expressed as conceptual graphs, followed by a series of joins which are performed revealing the sensitive target. It is shown that conceptual graph representations are able to analyze second path problems and achieve the same results as previous techniques. A new inference path was discovered that had not been identified by previous work.
منابع مشابه
Database Inference – Conceptual Graphs Using Conceptual Graphs To Represent Database Inference Security Analysis
This paper describes an approach to database inference analysis based on conceptual graphs. The database inference problem is briefly described. Previous approaches are summarized, followed by a presentation of our inference model, called AERIE. The notions of an inference target class and an inference method class are introduced with examples given. Conceptual graphs are introduced as our mean...
متن کاملNatural Induction and Conceptual Clustering: A Review of Applications
Natural induction and conceptual clustering are two methodologies pioneered by the GMU Machine Learning and Inference Laboratory for discovering conceptual relationships in data, and presenting them in the forms easy for people to interpret and understand. The first methodology is for supervised learning (learning from examples) and the second for unsupervised learning (clustering). Examples of...
متن کاملPohl-Warnsdorf – Revisited
Two new series of graphs are introduced. Properties of these graphs make them suitable as test beds for Hamiltonian path heuristics. The graphs are planar and regular of degree 3, and each series has a simple recursive definition. These graphs are “conceptual adversaries” to methods that try to exploit local characteristics. For each series, we give an analysis showing that the number of Hamilt...
متن کاملSimple Conceptual Graphs and Simple Concept Graphs
Sowa’s Conceptual Graphs and Formal Concept Analysis have been combined into another knowledge representation formalism named Concept Graphs. In this paper, we compare Simple Conceptual Graphs with Simple Concept Graphs, by successively studying their different syntaxes, semantics, and entailment calculus. We show that these graphs are almost identical mathematical objects, have equivalent sema...
متن کاملSimple Concept Graphs: A Logic Approach
Conceptual Graphs and Formal Concept Analysis are combined by developing a logical theory for concept graphs of relational contexts. Therefore, concept graphs are introduced as syntactical constructs , and their semantics is deened based on relational contexts. For this contextual logic, a sound and complete system of inference rules is presented and a standard graph is introduced that entails ...
متن کامل